منابع مشابه
The Discrete Diffraction Transform
In this paper we define a discrete analogue of the continuous diffracted projection. we define a discrete diffracted transform (DDT) as a collection of the discrete diffracted projections taken at specific set of angles along specific set of lines. We define ‘discrete diffracted projection’ to be a discrete transform that is similar in its properties to the continuous diffracted projection. We ...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملThe Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملThe Discrete Cosine Transform
Each Discrete Cosine Transform uses N real basis vectors whose components are cosines. In the DCT-4, for example, the jth component of v k is cos(j + 1 2)(k + 1 2) N. These basis vectors are orthogonal and the transform is extremely useful in image processing. If the vector x gives the intensities along a row of pixels, its cosine series P c k v k has the coeecients c k = (x; v k)=N. They are q...
متن کاملThe Discrete Fourier Transform
Disclaimer: These notes are intended to be an accessible introduction to the subject, with no pretense at completeness. In general, you can find more thorough discussions in Oppenheim's book. Please let me know if you find any typos. In this lecture, we discuss the Discrete Fourier Transform (DFT), which is a fourier representation for finite length signals. The main practical importance of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IMA Journal of Applied Mathematics
سال: 2008
ISSN: 0272-4960,1464-3634
DOI: 10.1093/imamat/hxn010